- connectivity rule
- AG правило связностиограничение типов и количества сетевых объектов, которые могут подключаться друг к другу в базе геоданных
Англо-русский толковый словарь по геоинформатике. В.Ю. Андрианов. 2015.
connectivity rule
Смотреть что такое "connectivity rule" в других словарях:
Rule Interchange Format — Le Rule Interchange Format (RIF ) est une recommandation du W3C. RIF fait partie de la feuille de route du web sémantique, avec principalement SPARQL, RDF et OWL. Bien que prévu initialement par beaucoup comme une couche de règles logiques pour… … Wikipédia en Français
Design rule checking — or Check(s) (DRC) is the area of Electronic Design Automation that determines whether the physical layout of a particular chip layout satisfies a series of recommended parameters called Design Rules. Design rule checking is a major step during… … Wikipedia
Semantic Web Rule Language — SWRL (Semantic Web Rule Language) est un langage de règles pour le web sémantique, combinant le langage OWL DL et le langage RuleML (Rule Markup Language (Unary/Binary Datalog)). En comparaison avec DLP (Description Logic Programs), une autre… … Wikipédia en Français
Roman Britain — History of the British Isles This box: view · talk · edit … Wikipedia
complexity — /keuhm plek si tee/, n., pl. complexities for 2. 1. the state or quality of being complex; intricacy: the complexity of urban life. 2. something complex: the complexities of foreign policy. [1715 25; COMPLEX + ITY] * * * ▪ scientific theory… … Universalium
Border Gateway Protocol — BGP redirects here. For the Formula One Team, see Brawn GP. The Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or prefixes which designate network reachability … Wikipedia
Criticism of APL — APL has been used since the mid 1960s on mainframe computers and has itself evolved in step with computers and the computing market. APL is not widely used, but minimalistic and high level by design, at several points in its history it could have … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Polyhedral skeletal electron pair theory — In chemistry the polyhedral skeletal electron pair theory provides electron counting rules useful for predicting the structures of clusters such as borane and carborane clusters. The electron counting rules were originally formulated by Kenneth… … Wikipedia
Katihar — Infobox Indian Jurisdiction native name = Katihar | type = city | latd = 25.53 | longd = 87.58 locator position = right | state name = Bihar district = Katihar leader title = leader name = altitude = 20 population as of = 2001 population total =… … Wikipedia
Criticism of the APL programming language — The APL programming language has been used since the mid 1960s on mainframe computers and has itself evolved in step with computers and the computing market. APL is not widely used, but minimalistic and high level by design, at several points in… … Wikipedia
